Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata1
نویسنده
چکیده
We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC 1 = Log(CFL)) can be accepted by a symmetric auxiliary pushdown automaton in polynomial time. Keywords-Symmetric Computation, Auxiliary Pushdown Automata, LogCFL, Reversible Computation
منابع مشابه
Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata
An alternating auxiliary pushdown hierarchy is defined by extending the machine model of the Logarithmic Alternation Hierarchy by a pushdown store while keeping a polynomial time bound. Although recently it was proven by Borodin et al. that the class of languages accepted by nondeterministic logarithmic space bounded auxiUary pushdown automata with a polynomial time bound is closed under comple...
متن کاملUnambiguous Simulations of Auxiliary Pushdown Automata and Circuits 3 (preliminary Version)
In this paper time-bounded auxiliary push-down automata (AuxPDA), i.e. time and space bounded Turing machines with additional pushdown store, are considered. We investigate the power of unambiguous AuxPDA, i.e., machines that have at most one accepting computation, and ambiguity bounded AuxPDA. Recently, it was shown by Buntrock, Hemachandra, and Siefkes that space bounded Turing machines, whos...
متن کاملProperties of Probabilistic Pushdown Automata
Properties of probabilistic as well as \probabilistic plus nondeterministic" pushdown automata and auxiliary pushdown automata are studied. These models are analogous to their counterparts with nondeterministic and alternating states. Complete characterizations in terms of well-known complexity classes are given for the classes of languages recognized by polynomial time-bounded, logarithmic spa...
متن کاملRemoving Nondeterminism in Constant Height Pushdown Automata
We study the descriptional cost of removing nondeterminism in constant height pushdown automata — i.e., pushdown automata with a built-in constant limit on the height of the pushdown. We show a double-exponential size increase when converting a constant height nondeterministic pushdown automaton into an equivalent deterministic device. Moreover, we prove that such a double-exponential blow-up c...
متن کاملUnambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits
Notions of unambiguity for uniform circuits and AuxPDAs are studied and related to each other. In particular, a coincidence for counting and unambiguous versions of AuxPDAs and semi-unbounded fan-in circuits is shown. Moreover, an improved simulation of LOGUCFL (the class of languages logspace many-one reducible to unambiguous context-free languages) by unambiguous circuits and AuxPDAs is devel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010